The Event Calculus in Probabilistic Logic Programming with Annotated Disjunctions

نویسندگان

  • Kevin McAreavey
  • Kim Bauters
  • Weiru Liu
  • Jun Hong
چکیده

We propose a new probabilistic extension to the event calculus using the probabilistic logic programming (PLP) language ProbLog, and a language construct called the annotated disjunction. This is the first extension of the event calculus capable of handling numerous sources of uncertainty (e.g. from primitive event observations and from composite event definitions). It is also the first extension capable of handling multiple sources of event observations (e.g. in multi-sensor environments). We describe characteristics of this new extension (e.g. rationality of conclusions), and prove some important properties (e.g. validity in ProbLog). Our extension is directly implementable in ProbLog, and we successfully apply it to the problem of activity recognition under uncertainty in an event detection data set obtained from vision analytics of bus surveillance video.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic Programs with Annotated Disjunctions

Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, we introduce a new formalism, Logic Programs with Annotated Disjunctions, based on disjunctive logic programs. In this formalism, each of the disjuncts in the head of a clause is annotated with a probability. Viewing such ...

متن کامل

On the equivalence between CP-logic and LPADs

We give a detailed proof of the fact that the probabilistic logics of Logic Programs with Annotated Disjunctions (LPADs) and CP-logic are equivalent. This report contains a detailed proof of the fact that Logic Programs with Annotated Disjunctions (LPADs) (6) and CP-logic (5) are equivalent. Before moving on to this proof, we first present some preliminaries from lattice theory and logic progra...

متن کامل

Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics

Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. The paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is bas...

متن کامل

The SLGAD Procedure for Inference on Logic Programs with Annotated Disjunctions

Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. The paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is bas...

متن کامل

Learning Logic Programs with Annotated Disjunctions

Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we propose an algorithm for learning LPADs. The learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017